Resource allocation in a radio access network

ABSTRACT

In a radio access network, techniques for enabling the network to provide a service availability guarantee to a user of a premium service without requiring the network to identify a priority level of a connection with an access terminal associated with the premium service user prior to connection establishment.

TECHNICAL FIELD

This disclosure relates to resource allocation in a radio accessnetwork.

BACKGROUND

High Data Rate (HDR) is an emerging mobile wireless access technologythat enables personal broadband Internet services to be accessedanywhere, anytime (see P. Bender, et al., “CDMA/HDR: ABandwidth-Efficient High-Speed Wireless Data Service for Nomadic Users”,IEEE Communications Magazine, July 2000, and 3GPP2, “Draft Baseline Textfor 1xEV-DO,” Aug. 21, 2000). Developed by Qualcomm, HDR is an airinterface optimized for Internet Protocol (IP) packet data services thatcan deliver a shared forward link transmission rate of up to 2.46 Mbit/sper sector using only (1×) 1.25 MHz of spectrum. Compatible withCDMA2000 radio access (TIA/EIA/IS-2001, “Interoperability Specification(IOS) for CDMA2000 Network Access Interfaces,” May 2000) and wireless IPnetwork interfaces (TIA/EIA/TSB-115, “Wireless IP Architecture Based onIETF Protocols,” Jun. 6, 2000, and TIA/ELA/IS-835, “Wireless IP NetworkStandard,” 3rd Generation Partnership Project 2 (3GPP2), Version 1.0,Jul. 14, 2000), HDR networks can be built entirely on IP technologies,all the way from the mobile Access Terminal (AT) to the global Internet,thus taking advantage of the scalability, redundancy and low-cost of IPnetworks.

HDR has been adopted by Telecommunication Industry Association (TIA) asa new standard in the CDMA2000 family, an EVolution of the current 1xRTTstandard for high-speed data-only (DO) services, commonly referred to as1xEV-DO, Rev. 0 and standardized as TIA/EIA/IS-856, “CDMA2000 High RatePacket Data Air Interface Specification,” 3GPP2 C.S0024-0, Version 4.0,Oct. 25, 2002, which is incorporated here by reference. Revision A tothis specification has been published as TIA/EIA/IS-856, “CDMA2000 HighRate Packet Data Air Interface Specification,” 3GPP2 C.S0024-A, Version1.0, March 2004, Ballot Resolution, but has yet not been adopted.Revision A is also incorporated here by reference.

A 1xEV-DO radio access network (RAN) includes access terminals incommunication with radio nodes over airlinks. Each access terminal maybe a laptop computer, a Personal Digital Assistant (PDA), a dual-modevoice/data handset, or another device, with built-in 1xEV-DO support.The radio nodes are connected to radio node controllers over a backhaulnetwork that can be implemented using a shared IP or metropolitanEthernet network which supports many-to-many connectivity between theradio nodes and the radio node controllers. The radio access networkalso includes a packet data serving node, which is a wireless edgerouter that connects the RAN to the Internet.

1xEV-DO, Rev. 0 radio access networks handle all connections with accessterminals in an identical manner. Network resources are allocated toconnections on a first-come-first-served basis. If there areinsufficient network resources available when a connection request isreceived, the connection request is denied.

One feature that can be enabled by 1xEV-DO, Rev. A radio access networksis classification of connections into priority levels (e.g., highpriority level or low priority level) based on quality of service (QoS)requirements. Network operators of QoS-enabled radio access networks canimplement a tier pricing structure commensurate with differentguaranteed levels of connection-based performance, such as bandwidth,call blocking rate, and call drop rate. Examples of ways in which aQoS-enabled radio access network can be used include priority levelclassification based on static information (e.g., a user subscriptionlevel or an access terminal type), dynamic information (e.g., arequested QoS service type), or both.

In one example of priority level classification based on staticinformation, user profiles each indicating a subscription level (e.g.,gold, silver, or bronze) of a user and/or a type of access terminal(e.g., Rev. 0 access terminal or Rev. A access terminal) that isassociated with the user are communicated to the radio access network bythe packet data serving node. When a connection request is received bythe radio access network from an access terminal, the radio accessnetwork accesses the user profile associated with the access terminalmaking the connection request and classifies the connection as being ahigh or low priority level connection based on the user subscriptionlevel and/or access terminal type. For example, connections requested byRev. 0 access terminals are classified as low priority level connectionsand connections requested by Rev. A access terminals are classified ashigh priority level connections. This form of priority levelclassification may result in low resource utilization if the resourcesallocated to the high priority level connections between the Rev. Aaccess terminals and the radio access network are not fully utilized(e.g., the Rev. A access terminal is configured to support delaysensitive services but those services are not used during the lifetimeof the connection), while connection attempts made by Rev. 0 accessterminals are denied due to insufficient network resource availability.

In one example of priority level classification based on dynamicinformation, the radio access network supports premium services, such asdelay sensitive services (e.g., a push-to-talk service or a Voice overIP service). In order to guarantee a certain level of performance tousers of premium services (“premium users”), the radio access networkneeds to distinguish the premium users from users of best effortservices (“regular users”). To do so, the radio access network relies onthe signaling behavior of access terminals (e.g., in accordance with theGeneric Attribute Update Protocol defined in the TIA/EIA/IS-856, Rev. Astandard) to indicate whether a premium service is being activated. Thesignaling behavior of some access terminals negotiates and activatespremium services during session configuration before setting up aconnection. Other access terminals are configured such that thesignaling behavior negotiates and activates premium services after theconnection is established. In the latter case, the radio access networkmay be unable to identify an access terminal as being operated by apremium user during resource allocation and deny the connection attemptif there are insufficient network resources available. This may resultin a failure to satisfy a service availability guarantee to premiumusers.

SUMMARY

In one aspect, the invention features a method that enables a radioaccess network to provide a service availability guarantee to a user ofa premium service without requiring the radio access network to identifya priority level of a connection with an access terminal associated withthe premium service user prior to connection establishment.

Implementations of the invention may include one or more of thefollowing. The method may include establishing a session for the accessterminal on the radio access network; and identifying the priority levelof the connection based on session information. The session may beestablished prior to or after connection establishment. The sessioninformation may include an activated service identifier, such as apremium service identifier or a regular service identifier. The prioritylevel of the connection may be identified as one of at least twopriority levels, such as a low priority level or a high priority level.

The method may include allocating a resource of the radio access networkto the connection based on the priority level of the connection. Themethod may include establishing a connection with the access terminal;and maintaining the connection for a period of time while the prioritylevel of the connection is identified. The method may includedetermining whether a resource of the radio access network is to beallocated to the connection based on the priority level identification.The method may include determining whether a resource of the radioaccess network is available for allocation to the connection based onthe priority level identification. The method may include terminatingthe connection if the priority level of the connection cannot beidentified within the period of time. The method may include terminatinga first connection in order to reclaim an allocated resource of theradio access network for subsequent allocation to a second connection,the second connection having a relatively higher priority level than thefirst connection.

In another aspect, the invention features a method in which, in a radioaccess network having N resources of which M are reserved for newconnection establishment, providing a service availability guaranteethat enables the radio access network to allocate at least K resourcesto connections associated with users of premium services, and allocateup to N-M resources to connections associated with users of regularservices.

In other aspects, corresponding computer programs and apparatus are alsoprovided.

Advantages that may be exhibited by particular implementations of theinvention include one or more of the following. Network operators canaccurately identify a premium user without having to rely on specificsignaling behaviors of the premium user's access terminal. Onceidentified, the connection established between the premium user's accessterminal is classified as a high priority level connection and resourcesare allocated such that a desired and/or required level ofconnection-based performance is guaranteed. The numbers of high and lowpriority level connections established at any given time can be easilyadapted to optimize resource utilization, while ensuring that highpriority level connections are provided with sufficient networkresources so as to meet or exceed service availability guarantees.

Descriptions of one or more examples are set forth in the descriptionbelow. Other features, aspects, and advantages will become apparent fromthe description and the claims.

DESCRIPTION OF DRAWINGS

FIG. 1 is a block diagram of a radio access network.

FIG. 2 shows cells of a radio access network.

FIG. 3 shows available connection resources of a sector.

FIG. 4 is a flowchart of a resource allocation process.

FIGS. 5 a and 5 b show resource allocation over a time period.

DETAILED DESCRIPTION

FIG. 1 shows a 1xEV-DO, Rev. A radio access network 100 with a radionode controller 102 connected to two radio nodes 104 a, 104 b over apacket network 106. The packet network 106 can be implemented as anIP-based network that supports many-to-many connectivity between theradio nodes 104 a, 104 b and the radio node controller 102. The radionode controller 102 is connected to the Internet 110 via a packet dataserving node 108. Other radio nodes, radio node controllers, and packetnetworks (not shown in FIG. 1) can be included in the radio accessnetwork 100.

Network resources are allocated to access terminals 112 a-112 f in orderto enable the access terminals 112 a-112 f to communicate with the radioaccess network 100. Although there are several different types ofnetwork resources that are needed to establish a connection between eachaccess terminal and the radio access network 100, the example techniquesdescribed below refer to a connection resource in a sector. Thetechniques are similarly applicable to the other types of networkresources.

Referring also to FIG. 2, each radio node 104 a, 104 b can supportmultiple sectors 121, with each sector covering a certain cell area 123around the radio node 104 a, 104 b. Each active access terminal 112 isin communication with a radio node, e.g., radio node 104 a, using anairlink 120. The airlink 120 comprises a forward traffic channel(depicted in FIG. 2 by a solid-lined arrow), which carries datatransmitted from the radio node 104 a to the access terminal 112 a, anda reverse traffic channel (depicted in FIG. 2 by a broken-lined arrow),which carries data transmitted from the access terminal 112 a to theradio node 104 a.

Whenever the access terminal 112 a sends a ConnectionRequest messageover a reverse traffic channel along with a RouteUpdate message toinitiate a new connection with the radio access network 100, themessages are immediately forwarded from the receiving radio node, e.g.,radio node 104 a, to its serving radio node controller, in this case,radio node controller 102 (FIG. 1). The serving radio node controller102 examines the RouteUpdate message to determine a likely set ofsectors that may be included in an active set for the access terminal112 a. Suppose the active set of sectors includes the sectors 121 thatcover cell area A 123. The serving radio node controller 102communicates with the radio node 104 a where these sectors 121 reside torequest connection resources. The radio node 104 a allocates thesufficient connection resources to establish the connection. The servingradio node controller 102 then accepts the connection request, andcauses the radio node 104 a to send a TrafficChannel assignment essageover the forward traffic channel to the access terminal 112 a. Theaccess terminal 112 a returns a ReverseTrafficChannel (RTC) indicationon the reverse traffic channel. Once the radio node 104 a acquires theRTC indication, the radio node sends a ReverseTrafficChannelAcknowledge(RTCAck) message to the access terminal 112 a to indicate theacquisition of the RTC signal. The access terminal 112 a then respondswith a TrafficChannelComplete message to indicate the completion of theconnection set-up.

In this procedure, each radio node 104 a, 104 b controls its ownconnection resources, with respect to both hardware resources availableon the radio node and management of interference across its sectors. Asa result, admission control is split between the radio node 104 a, 104 band its serving radio node controller 102. Admission control involvesdetermining, based on a number of factors, whether a new user is to beadded to the network 100 given the new user's likely impact on theperformance of existing users and network components. Examples offactors include the current resource usage by existing users, theresources requested by the new user, measurement of current networkperformance, and policies imposed by the network operator. Radio nodes104 a, 104 b provide local admission control for the sectors theycontrol while the serving radio node controller 102 provides a globaladmission control. The portions of each radio node 104 a, 104 b and itsserving radio node controller 102 that perform the admission controlfunction are collectively referred to in this description as an“admission control component” of the radio access network 100.

An admission control component of the radio access network 100 can beimplemented to provide service availability guarantees even if apriority level of a connection cannot be determined at the time theconnection is established. Referring to FIG. 3, suppose there are N_(CE)connection resources available for a given sector and T_(buffer,max) ofthe N_(CE) connection resources are reserved for use by the admissioncontrol component as a staging area for new connections. Provision of astaging area enables access terminals to have a high connection set upsuccess rate as the admission control component can allocate up toT_(buffer,max) connection resources to new connections. The number ofT_(buffer,max) connection resources that are actually in use at anygiven time is represented by T_(buffer), that is,0≦T_(buffer)≦T_(buffer,max). T_(buffer,max) can be set or modified bythe network operator to obtain a predetermined call blockingperformance.

The network operator can establish a service availability guarantee forusers of premium services (“premium users”) in that sector by reservingat least T_(premium) of the N_(CE) connection resources for allocationto high priority level connections. Yet, instead of limiting users ofbest effort services (“regular users”) to only the remainingN_(CE)−T_(premium) connection resources, the admission control componentcan be implemented to allocate up to N_(CE)−T_(buffer) connectionresources.

FIG. 4 shows a resource allocation process 400 implemented by anadmission control component of the radio access network 100. When aconnection request is received (402), the admission control componentfirst determines (404) whether the number of free connection resourcesn_(freeCE) among the N_(CE) connection resources is at least a large asthe number of new connections requested. In some examples,n_(freeCE)=N_(CE)−n_(reg)−n_(premium)−n_(trans), where n_(reg) is thenumber of connection resources currently used by regular users,n_(premium) is the number of connection resources currently used bypremium users, and n_(trans) is the number of connection resourcecurrently allocated to transient connections (i.e., connections that theadmission control component has not identified as a low or high prioritylevel connection). If there are not enough free connection resources,the admission control component rejects (406) the connection request.Otherwise, the admission control component accepts (408) the connectionrequest, establishes the connection, and increments n_(trans) by 1. Theconnection remains in the staging area for a period of time (referred toas a “grace period”) while the admission control component performs(410) a priority level classification of the connection.

In some examples, the connection is established with an access terminalthat performs premium service negotiation and activation before theconnection is set up. The admission control component classifies (412 a)the connection as being a high priority level connection.

In some examples, the connection is established with an access terminalthat performs premium service negotiation and activation after theestablishment of the connection. The admission control component firstclassifies the connection as having a low priority level. Uponindication of a completion of the premium service activation process,the admission control component may upgrade the connection to a highpriority level classification (412 b).

Once a connection is classified as a high priority level classification,the admission control component increments n_(premium) by 1 anddecrements n_(trans) by 1. The admission control component then checksto see if the size of T_(buffer) is to be changed with the addition of anew premium user. In some examples, the admission control componentfirst determines (414) if n_(premium)+T_(buffer)<T_(premium). If thedetermination yields a positive result, then T_(buffer)=T_(buffer,max)(416). In other words, the number of premium users on the network 100has not exceeded the service availability guarantee for premium users,so the admission control component maintains the size of the stagingarea at its maximum in order to keep the call blocking probability low.If, however, the determination yields a negative result, then theadmission control component performs (418) a check as follows: if(n_(premium)<T_(premium)) is true, thenT_(buffer)=min(T_(premium)−n_(premium), T_(buffer,max)) (420), elseT_(buffer)=0 (422). In other words, the admission control component canadjust the size of the staging area as the number of premium users onthe network 100 meets or exceeds the service availability guarantee forpremium users. In the event T_(buffer)=0, the staging area is removedand the admission control component accepts connection requests fromaccess terminals on a first-come-first-serve basis as connectionresources become available. The staging are is re-established only whenn_(premium) falls below T_(premium). Thus, the staging area grows andcontracts dynamically as connection resources are used and reclaimed.

In some instances, it may be necessary for the admission controlcomponent to terminate one or more low priority level connections inorder to maintain the staging area at T_(buffer,max) or T_(buffer). Insome examples, the admission control component determines (424) if lowpriority level connections are to be terminated using the followingcheck: if (m>0) and (n_(freeCE)<m), where m=max(T_(buffer)−n_(trans), 0)and n_(freeCE)=(N_(CE)−n_(reg)−n_(premium)−n_(trans)), then terminate(426) (m−n_(freeCE)) low priority level connections, otherwise take noaction (428). Reclaiming a connection resource from a low priority levelconnection enables the admission control component to maintain the sizeof the staging area at T_(buffer,max) or T_(buffer), while allocatingenough connection resources to the high priority level connections.Although the termination of low priority connections can result in ahigh call drop rate for the regular users, such cost can be justified ifthe network operators desires to guarantee low call blocking rate forhigh priority connections.

If the access terminal does not perform premium service negotiation andactivation before the connection is set up or the premium serviceactivation process fails to complete within the grace period, the accesscontrol component classifies (430) the connection as a low prioritylevel connection by default. The admission control component thendetermines (432) whether (N_(CE)−(n_(premium)+n_(reg)+1))>T_(buffer). Apositive result (434) indicates that there are sufficient connectionresources available for allocation to the low priority level connection,in which case the admission control component allocates the connectionresource, increments n_(reg) by 1 and decrements n_(trans) by 1.Otherwise, the admission control component rejects (436) the connectionrequest and decrements n_(trans) by 1.

FIG. 5 a shows an example of resource allocation of a sector by anadmission control component of a radio access network over a period oftime. In the illustrated example, there are 22 available connectionresources for a given sector, and the network operator has established aservice availability guarantee for premium users in that sector thatreserves at least 10 of the 22 connection resources for allocation tohigh priority level connections. Regular user may use up to 14 of the 22connection resources.

Suppose at time t=0, 14 connection resources are used by regular users,3 connection resources are used by premium users, and T_(buffer)=5. Inthis example, T_(buffer) is used as the staging area, although in otherexamples, the staging area may be outside of T_(buffer) (as describedbelow with reference to FIG. 5 b).

At time t=1, two new connection requests are received. The admissioncontrol component determines that there are enough connection resourcesavailable for allocation to the new connections, and establishes theconnections A and B using two of the available T_(buffer) connectionresources in the staging area. n_(trans)=2.

At time t=2 (during the grace period), the admission control componentclassifies the connection A as a low priority level connection andchecks if (N_(CE)−(n_(premium)+n_(reg)+1))≧T_(buffer). The negativeresult indicates that counting the connection A towards nreg wouldresult in the reduction of T_(buffer) from 5 to 4. As this is anunacceptable outcome, the admission control component terminates the lowpriority level connection A, and decrements n_(trans) by 1.

At time t=3 (during the grace period), the admission control componentclassifies the connection B as a high priority level connection,increments n_(premium) by 1 and decrements n_(trans) by 1. The admissioncontrol component then checks to see if the size of T_(buffer) is to bechanged with the addition of a new premium user. In some examples, theadmission control component first determines ifn_(premium)+T_(buffer)≦T_(premium). In this example,n_(premium)(4)+T_(buffer)(5)<T_(premium)(10), soT_(buffer)=T_(buffer,max)(5). The admission control component thendetermines if low priority level connections are to be terminated inorder to maintain the staging area at T_(buffer)=T_(buffer,max)(5) usingthe following check: if (m>0) and (n_(freeCE)<m), wherem=max(T_(buffer)(5)−n_(trans)(0),0)=5 andn_(freeCE)=(N_(CE)(22)−n_(reg)(14)−n_(premium)(4)−n_(tans)(0))=4, thenterminate (m(5)−n_(freeCE)(4))=1 low priority level connection.

FIG. 5 b shows an example of resource allocation of a sector by anadmission control component of a radio access network over a period oftime. In the illustrated example, there are 22 available connectionresources for a given sector, and the network operator has established aservice availability guarantee for premium users in that sector thatreserves at least 10 of the 22 connection resources for allocation tohigh priority level connections. Regular user may use up to 14 of the 22connection resources.

Suppose at time t=0, 4 connection resources are used by regular users, 3connection resources are used by premium users, and T_(buffer)=5.

At time t=1, three new connection requests are received. The admissioncontrol component determines that there are enough connection resourcesavailable for allocation to the new connections, and establishes theconnections C, D, and E using three of the free connection resourcesthat are outside of T_(buffer), that is, the staging area in thisexample is outside T_(buffer). n_(trans)=3.

At time t=2 (during the grace period), the admission control componentclassifies all three connections C, D, and E as high priority levelconnections, increments n_(premium) by 3 and decrements n_(trans) by 3.The admission control component then checks to see if the size ofT_(buffer) is to be changed with the addition of the three new premiumusers. In some examples, the admission control component firstdetermines if n_(premium)+T_(buffer)≦T_(premium). In this example, sincen_(premium)(6)+T_(buffer)(5)>T_(premium)(10), the admission controlcomponent performs a check as follows: if (n_(premium)<T_(premium)) istrue, then T_(buffer)=min(T_(premium)−n_(premium), T_(buffer,max)). Asn_(premium)(6)<T_(premium)(10), the admission control component adjustsT_(buffer) to have a size ofT_(buffer)=min(T_(premium)(10)−n_(premium)(6), T_(buffer,max)(5))=4. Theadmission control component then determines if low priority levelconnections are to be terminated in order to maintain the staging areaat T_(buffer)=4. To do so, the admission control component determinesthe values of m and n_(freeCE), wherem=max(T_(buffer)(4)−n_(trans)(0),0)=4 andn_(freeCE)=(N_(CE)(22)−n_(reg)(4)−n_(premium)(6)−n_(trans)(0))=12. Sincem(4) is greater than 0 but n_(freeCE)(12) is not less than m(4), no lowpriority level connections need to be terminated in order to maintainthe staging area at T_(buffer)=4.

By allowing the regular users to be allocated up to N_(CE)−T_(buffer)connection resources and constantly changing the mix of available highand low priority level connections, network operators can guaranteecertain levels of performance to premium users in accordance withestablished service availability guarantees, while optimizing resourceutilization.

Although the techniques described above employ the 1xEV-DO air interfacestandard, the techniques are also applicable to other CDMA and non-CDMAair interface technologies in which premium services are available foruse.

The techniques described above can be implemented in digital electroniccircuitry, or in computer hardware, firmware, software, or incombinations of them. The techniques can be implemented as a computerprogram product, i.e., a computer program tangibly embodied in aninformation carrier, e.g., in a machine-readable storage device or in apropagated signal, for execution by, or to control the operation of,data processing apparatus, e.g., a programmable processor, a computer,or multiple computers. A computer program can be written in any form ofprogramming language, including compiled or interpreted languages, andit can be deployed in any form, including as a stand-alone program or asa module, component, subroutine, or other unit suitable for use in acomputing environment. A computer program can be deployed to be executedon one computer or on multiple computers at one site or distributedacross multiple sites and interconnected by a communication network.

Method steps of the techniques described herein can be performed by oneor more programmable processors executing a computer program to performfunctions of the invention by operating on input data and generatingoutput. Method steps can also be performed by, and apparatus of theinvention can be implemented as, special purpose logic circuitry, e.g.,an FPGA (field programmable gate array) or an ASIC (application-specificintegrated circuit). Modules can refer to portions of the computerprogram and/or the processor/special circuitry that implements thatfunctionality.

Processors suitable for the execution of a computer program include, byway of example, both general and special purpose microprocessors, andany one or more processors of any kind of digital computer. Generally, aprocessor will receive instructions and data from a read-only memory ora random access memory or both. The essential elements of a computer area processor for executing instructions and one or more memory devicesfor storing instructions and data. Generally, a computer will alsoinclude, or be operatively coupled to receive data from or transfer datato, or both, one or more mass storage devices for storing data, e.g.,magnetic, magneto-optical disks, or optical disks. Information carrierssuitable for embodying computer program instructions and data includeall forms of non-volatile memory, including by way of examplesemiconductor memory devices, e.g., EPROM, EEPROM, and flash memorydevices; magnetic disks, e.g., internal hard disks or removable disks;magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor andthe memory can be supplemented by, or incorporated in special purposelogic circuitry. Other embodiments are within the scope of the followingclaims.

1. A method comprising: enabling a radio access network to provide aservice availability guarantee to a user of a premium service withoutrequiring the radio access network to identify, prior to connectionestablishment, a priority level of a connection with an access terminalassociated with the user; wherein enabling the radio access network toprovide the service availability guarantee comprises: establishing theconnection with the access terminal; classifying the connection ashaving a low priority level; maintaining the connection for a period oftime while the priority level is identified; and upgrading theconnection to a high priority level if the priority level is identifiedas the high priority level, the high priority level being a higherpriority level relative to the low priority level.
 2. The method ofclaim 1, wherein enabling the radio access network to provide theservice availability guarantee further comprises: establishing a sessionfor the access terminal on the radio access network; and identifying thepriority level based on session information.
 3. The method of claim 2,wherein establishing the session comprises: establishing the sessionprior to connection establishment.
 4. The method of claim 2, whereinestablishing the session comprises: establishing the session afterconnection establishment.
 5. The method of claim 2, wherein the sessioninformation comprises an activated service identifier.
 6. The method ofclaim 5, wherein the activated service identifier comprises a premiumservice identifier or a regular service identifier.
 7. The method ofclaim 2 wherein enabling the radio access network to provide the serviceavailability guarantee further comprises: identifying the priority levelas one of at least two priority levels.
 8. The method of claim 2 whereinenabling the radio access network to provide the service availabilityguarantee further comprises: identifying the priority level as the lowpriority level or the high priority level.
 9. The method of claim 1,wherein enabling the radio access network to provide the serviceavailability guarantee further comprises: allocating a resource of theradio access network to the connection based on the priority level. 10.The method of claim 1, wherein enabling the radio access network toprovide the service availability guarantee further comprises:determining whether a resource of the radio access network is to beallocated to the connection based on the priority level.
 11. The methodof claim 1, wherein enabling the radio access network to provide theservice availability guarantee further comprises: determining whether aresource of the radio access network is available for allocation to theconnection based on the priority level.
 12. The method of claim 1,wherein enabling the radio access network to provide the serviceavailability guarantee further comprises: terminating the connection ifthe priority level cannot be identified within the period of time. 13.The method of claim 1, wherein enabling the radio access network toprovide the service availability guarantee further comprises:terminating a first connection in order to reclaim an allocated resourceof the radio access network for subsequent allocation to a secondconnection, the second connection having a relatively higher prioritylevel than the first connection.
 14. A computer readable storage mediumthat stores executable instructions for use at a radio node controllerof a radio access network, the computer readable storage medium being atangible medium, the instructions for causing one or more processors to:provide a service availability guarantee to a user of a premium servicewithout requiring the radio access network to identify, prior toconnection establishment, a priority level of a connection with anaccess terminal associated with the user; wherein providing the serviceavailability guarantee comprises: establishing the connection with theaccess terminal; classifying the connection as having a low prioritylevel; maintaining the connection for a period of time while thepriority level is identified; and upgrading the connection to a highpriority level if the priority level is identified as the high prioritylevel, the high priority level being a higher priority level relative tothe low priority level.
 15. The computer readable storage medium ofclaim 14, wherein providing the service availability guarantee furthercomprises: determining whether a resource of the radio access network isto be allocated to the connection based on the priority level.
 16. Thecomputer readable storage medium of claim 14, wherein providing theservice availability guarantee further comprises: determining whether aresource of the radio access network is available for allocation to theconnection based on the priority level.
 17. The computer readablestorage medium of claim 14, wherein providing the service availabilityguarantee further comprises: terminating the connection if the prioritylevel cannot be identified within the period of time.
 18. The computerreadable storage medium of claim 14, wherein providing the serviceavailability guarantee further comprises: terminating a first connectionin order to reclaim an allocated resource of the radio access networkfor subsequent allocation to a second connection, the second connectionhaving a relatively higher priority level than the first connection. 19.A radio access network device in a radio access network, comprising:memory configured to store instructions for execution; and one or moreprocessors configured to execute the instructions, the instructions forcausing the one or more processors to: provide a service availabilityguarantee to a user of a premium service without requiring the radioaccess network to identify, prior to connection establishment, apriority level of a connection with an access terminal associated withthe user; wherein providing the service availability guaranteecomprises: establishing the connection with the access terminal;classifying the connection as having a low priority level; maintainingthe connection for a period of time while the priority level isidentified; and upgrading the connection to a high priority level if thepriority level is identified as the high priority level, the highpriority level being a higher priority level relative to the lowpriority level.
 20. The radio access network device of claim 19, whereinthe radio access network device comprises a radio network controller.21. The radio access network device of claim 19, wherein the radioaccess network device comprises a radio node.
 22. The radio accessnetwork device of claim 19, wherein providing the service availabilityguarantee further comprises: determining whether a resource of the radioaccess network is to be allocated to the connection based on thepriority level.
 23. The radio access network device of claim 19, whereinproviding the service availability guarantee further comprises:determining whether a resource of the radio access network is availablefor allocation to the connection based on the priority level.
 24. Theradio access network device of claim 19, wherein providing the serviceavailability guarantee further comprises: terminating the connection ifthe priority level cannot be identified within the period of time. 25.The radio access network device of claim 19, wherein providing theservice availability guarantee further comprises: terminating a firstconnection in order to reclaim an allocated resource of the radio accessnetwork for subsequent allocation to a second connection, the secondconnection having a relatively higher priority level than the firstconnection.
 26. A method comprising: enabling a radio access network toprovide a service availability guarantee to a user of a premium servicewithout requiring the radio access network to identify, prior toconnection establishment, a priority level of a connection with anaccess terminal associated with the user; wherein enabling the radioaccess network to provide the service availability guarantee comprises:establishing the connection with the access terminal; maintaining theconnection for a period of time while the priority level is identified;and terminating the connection if the priority level cannot beidentified within the period of time.
 27. A computer readable storagemedium that stores executable instructions for use at a radio nodecontroller of a radio access network, the computer readable storagemedium being a tangible medium, the instructions for causing one or moreprocessors to: provide a service availability guarantee to a user of apremium service without requiring the radio access network to identify,prior to connection establishment, a priority level of a connection withan access terminal associated with the user; wherein providing theservice availability guarantee comprises: establishing the connectionwith the access terminal; maintaining the connection for a period oftime while the priority level is identified; and terminating theconnection if the priority level cannot be identified within the periodof time.
 28. A radio access network device in a radio access network,comprising: memory configured to store instructions for execution; andone or more processors configured to execute the instructions, theinstructions for causing the one or more processors to: provide aservice availability guarantee to a user of a premium service withoutrequiring the radio access network to identify, prior to connectionestablishment, a priority level of a connection with an access terminalassociated with the user; wherein providing the service availabilityguarantee comprises: establishing the connection with the accessterminal; maintaining the connection for a period of time while thepriority level is identified; and terminating the connection if thepriority level cannot be identified within the period of time.